On the Erlang Loss Model with Time Dependent Input

We consider the M(t)/M(t)/m/m queue, where the arrival rate λ(t) and service rate μ(t) are arbitrary (smooth) functions of time. Letting p_n(t) be the probability that n servers are occupied at time t (0≤ n≤ m, t > 0), we study this distribution asymptotically, for m→∞ with a comparably large arrival rate λ(t) = O(m) (with μ(t) = O(1)). We use singular perturbation techniques to solve the forward equation for p_n(t) asymptotically. Particular attention is paid to computing the mean number of occupied servers and the blocking probability p_m(t). The analysis involves several different space-time ranges, as well as different initial conditions (we assume that at t = 0 exactly n₀ servers are occupied, 0≤ n₀≤ m). Numerical studies back up the asymptotic analysis. AMS subject classification: 60K25,34E10 Supported in part by NSF grants DMS-99-71656 and DMS-02-02815     

Online weighted flow time and deadline scheduling

In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|r_i,pmtn|∑w_iF_i. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling.     

Nonlinear Time Series Analysis Since 1990:Some Personal Reflections

Abstract I reflect upon the development of nonlinear time series analysis since 1990 by focusing on five majorareas of development. These areas include the interface between nonlinear time series analysis and chaos,thenonparametric/semiparametric approach,nonlinear state space modelling,financial time series and nonlinearmodelling of panels of time series.     

Rapprochement of artificial intelligence and dynamics

It is proposed that continuous time is in effect discretized in the brain by dynamic pattern recognition mechanisms in neurons. Time discretization is required to support formal computations in continuous time systems consisting of a large number of components. The ability to perform formal computations is necessary if the system is to execute high level algorithms of the type used in present day artificial intelligence. The weakness of such algorithms is that they work efficiently only when the forms of patterns and objects presented to them are highly constrained. The dynamic mechanisms which discretize the brain's time line also serve to code patterns into constrained forms suitable for high level processing.     

Finite valued feedback laws and piecewise classical solutions

Often, in engineering literature, we find control systems in which the open loop inputs are piecewise constant and take values in a finite set. Such open loop inputs cause the system to have fairly regular solutions. On the other hand, when acting in closed loop, feedback laws taking values in a finite set may not be reinterpreted as open loop inputs of the considered type. In fact, pathological behaviours such as the accumulation of discontinuities may appear (Zeno phenomenon). We give some conditions which can be used as tools for building finite valued feedback laws not causing such pathological behaviours.     

饱和恢复法人体核磁共振自旋—晶格弛豫时间成象方法

当前,在医学核磁共振成象领域内,临床上广泛采用的是近似的自旋密度象、T1-和T2-加权密度象。但是,由于人体的正常组织和肿瘤之间的密度差别不大,从质子密度象很难区分人体的正常组织与肿瘤,而肿瘤与人体正常组织之间的在弛豫时间T1、T2的数值上差别较大。另外,自七十年代以来,大量关于离体(in vitro)核磁共振弛豫时间测量的文献表明,肿瘤的核磁共振弛豫时间T1,T2值具有明显的规律性,从而利用核磁共振弛豫时间成象的方法,及人体正常组织、良性及恶性肿瘤的活体(in vivo)T1,T2数值的测量,将有助于实现肿瘤识别的定量方法。     

偶氮苯衍生物三阶非线性的四波混频研究

用皮秒Ｎｄ：ＹＡＧ激光器的倍频光（５３２ｎｍ）对具有离域π－共轭电子云结构的偶氮苯类样品材料作简并四波混频补给，测得三阶非线性电极化率ｘ＾（３）和它们的时间响应分别为１０＾－９ｅｓｕ和２０ｐｓ，并对影响ｘ＾（３）的瞬时光栅作用和ｘ＾（３）的响应时间人了讨论。     

相型同步启动时间的M／M／c排队系统

本文研究带有同步启动时间的Ｍ／Ｍ／ｃ系统，其中启动时间是相型变量，给出了稳态和等待时间分布等结果。     

Fluorescence anisotropy decay study of self-association of bacterial luciferase intermediates

The fluorescence dynamics parameters of the fluorescent transient flavin-luciferase species from the typesVibrio fischeri andPhotobacterium leiognathi are presented. The fluorescence anisotropy decay is a single exponential function for both types. The correlation time is 70 ns for theP. leiognathi fluorescent transient intermediate (2°C, aqueous buffer, pH 7.0), consistent with the rotational correlation time of the luciferase macromolecule (77 kD) to which the flavin fluorophore is rigidly attached. In contrast, for theV. fischeri species the observed correlation time for the anisotropy decay function is 133 ns. This suggests that protein self-association occurs in theV. fischeri case and this is confirmed by filtration, where the fluorescent transient fromV. fischeri does not pass through a 100,000 molecular weight cutoff membrane, whereas theP. leiognathi species does. The filtration method also demonstrates self-association in the luciferase peroxyflavin and photoflavin fromV. fischeri. A monomer-dimer equilibrium also explains the previously reported high correlation times for theV. harveyi luciferase-flavin species. It is proposed that the self-association competes with the lumazine protein interaction in the bioluminescence reaction.     

时分复用倍乘光脉冲重复率的新型光纤耦合器环状连接法分析

提出并详细分析了一种基于时分复用技术倍乘光脉冲重复率的方法：在２×２光纤耦合器的一个输入口与一个输出口间，接入时延为脉冲列半周期奇数倍的一段光纤使之形成环状连接循环耦合，而在另一输出口获得光脉冲。详细分析了该系统中光纤耦合器耦合比、插入损耗、时延光纤长度的要求，偏差的影响及其调节法，给出了理论公式、结果的计算机模拟与实验介绍；与经典的马赫陈德尔干涉仪接法及近年提出的Ｓａｇｎａｃ环接法进行了比较。该方法特别适用于对窄脉冲列进行串接复用实现重复率的多次倍乘，从而得到数千兆赫至上百千兆赫的高重复率光脉冲